Four‐term progression free sets with three‐term progressions in all large subsets
نویسندگان
چکیده
This paper is mainly concerned with sets which do not contain four-term arithmetic progressions, but are still very rich in three-term the sense that all sufficiently large subsets at least one such progression. We prove there exists a positive constant c and set does progression, property for every subset , contains nontrivial three term derive this from more general quantitative Roth-type theorem random of improves result Kohayakawa–Łuczak–Rödl/Tao–Vu. also discuss similar phenomenon over integers. Finally, we include another application our methods, showing or “having progressions subsets” almost entirely uncorrelated additive energy.”
منابع مشابه
Arithmetic Progressions in Sets with Small Sumsets
We present an elementary proof that if A is a finite set of numbers, and the sumset A+G A is small, |A+G A| ≤ c|A|, along a dense graph G, then A contains k-term arithmetic progressions.
متن کاملCharacter-free approach to progression-free sets
We present an elementary combinatorial argument showing that the density of a progression-free set in a finite r-dimensional vector space is O(1/r).
متن کاملMaximal Arithmetic Progressions in Random Subsets
Let U (N) denote the maximal length of arithmetic progressions in a random uniform subset of {0, 1}N . By an application of the Chen-Stein method, we show that U −2 log N/ log 2 converges in law to an extreme type (asymmetric) distribution. The same result holds for the maximal length W (N) of arithmetic progressions (mod N). When considered in the natural way on a common probability space, we ...
متن کاملTriangle Free Sets and Arithmetic Progressions - Two Pisier Type Problems
Let Pf (N ) be the set of finite nonempty subsets of N and for F,G ∈ Pf (N ) write F < G when maxF < minG. Let X = {(F,G) : F,G ∈ Pf (N ) and F < G}. A triangle in X is a set of the form {(F ∪ H,G), (F,G), (F,H ∪ G)} where F < H < G. Motivated by a question of Erdős, Nešetŕıl, and Rödl regarding three term arithmetic progressions, we show that any finite subset Y of X contains a relatively larg...
متن کاملLarge minimal sets which force long arithmetic progressions
A classic theorem of van der Waerden asserts that for any positive integer k, there is an integer W(k) with the property that if IV> W(k) and the set { 1,2,..., W} is partitioned into r classes C,, C?,..., C,, then some C, will always contain a k-term arithmetic progression. Let us abbreviate this assertion by saying that { 1, 2,..., W} arrows AP(k) (written { 1, 2,..., IV} + AP(k)). Further, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2021
ISSN: ['1042-9832', '1098-2418']
DOI: https://doi.org/10.1002/rsa.21042